منابع مشابه
267 MENDEZ.pmd
Isidro Méndez-Larios. M.S. in Plant Biology, Universidad Nacional Autónoma de México (UNAM)). Graduate Student, Unidad de Biotecnología y Prototipos (UBIPRO), Facultad de Estudios Superiores Iztacala, UNAM, Mexico. Address: Av. De los Barrios No 1, Los Reyes Iztacala, Tlalnepantla, Estado de México. 54090 México. email: [email protected] José Luis Villaseñor. Ph.D. in Plant Systematics, T...
متن کامل261-267 Santelli
contraceptives. Demographic surveys of contraceptive use in the United States typically have collected and reported data only on use of single methods; when more than one method is described by a respondent, the one reported by the investigator is usually the method that most effectively prevents pregnancy.4 Likewise, studies of HIV and STD risk often do not include data on contraceptive use fo...
متن کاملPns1100003 263..267
As a population subgroup, older people are more vulnerable to malnutrition especially those who are institutionalised. Recognition of deteriorating or poor nutritional status is key in reversing the effects of undernutrition and reinforces the value of regular weight checks and/or the use of screening tools. Commercially produced supplements are often the first option used to address undernutri...
متن کاملEE 267 - Project proposal
Three dimensional (3D) displays are becoming popular consumer technologies. The 3D effect mainly comes from the projection of two respective images on right and left eyes. For example, some movie projectors superpose two different images on the same screen with orthogonal polarlization states so that viewers wearing polarlization glasses see different images with different eyes. Head-mounted di...
متن کاملCs 267 Lecture 3
Single-source shortest paths. In the single-source shortest paths problem (SSSP), we are given a graph G = (V,E) and a source node s ∈ V , and we must compute d(s, v) for all v ∈ V . If the graph is unweighted, we can solve this in O(m + n) time by breadth-first search (BFS). If the graph has nonnegative integer weights, we can use Dijkstra’s algorithm with Fibonacci heaps, yielding a runtime o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Australasian Journal of Educational Technology
سال: 2010
ISSN: 1449-5554,1449-3098
DOI: 10.14742/ajet.1024